Packing A-paths of length zero modulo a prime
نویسندگان
چکیده
It is known that A-paths of length 0 mod m satisfy the Erd?s-Pósa property if m=2 or m=4, but not m>4 composite. We show p prime, then property. More generally, in framework undirected group-labeled graphs, we characterize abelian groups ? and elements ??? for which holds weight ?.
منابع مشابه
Orders Modulo A Prime
In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary cyclotomic polynomials. References used in preparing this article are included in the last page. §1 Introduction I might as well state one of the main results of this article up front, so the following discussion seems a little more moti...
متن کاملPacking Non-Zero A-Paths In Group-Labelled Graphs
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊆V . An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P . (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of ...
متن کاملPacking paths of length at least two
We give a simple proof for Kaneko’s theorem which gives a su2cient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path system. c © 2004 Elsevier B.V. All righ...
متن کاملA Parameterized Perspective on Packing Paths of Length Two
We study (vertex-disjoint) packings of paths of length two (i.e., of P2’s) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use extremal combinatorial arguments for determining how many vertices of P appear in some P2-packing of size (j + 1) (if it exists). We prove that one can ’reuse’ 2.5j vertices. Based on a WIN-WIN approach, we build an algorit...
متن کاملSubset Sums modulo a Prime
Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2023
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2022.12.007